Graph partition into paths containing specified vertices
نویسندگان
چکیده
منابع مشابه
Graph partition into paths containing specified vertices
For a graph G, let 2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Suppose G is a graph of order n. Enomoto and Ota (J. Graph Theory 34 (2000) 163–169) conjectured that, if a partition n = ∑k i=1 ai is given and 2(G)¿ n + k − 1, then for any k distinct vertices v1; : : : ; vk , G can be decomposed into vertex-disjoint paths P1; : : : ; Pk such that |V (Pi)| = ai and vi is ...
متن کاملVertex-Disjoint Cycles Containing Specified Vertices in a Graph
Let k ≥ 2 and n ≥ 1 be integers, and let G be a graph of order n with minimum degree at least k + 1 . Let v1, v2, . . . vk be k distinct vertices of G , and suppose that there exist vertex-disjoint cycles C1, C2, . . . , Ck in G such that ∑k i=1 |V (C i)| ≥ 399 100 k and vi ∈ V (Ci) for each 1 ≤ i ≤ k . Suppose further that the minimum value of the sum of the degrees of two nonadjacent distinct...
متن کاملPartition of a graph into cycles and isolated vertices
Let k, r, n be integers with k ≥ 2, 0 ≤ r ≤ k−1 and n ≥ 10k+3. We prove that if G is a graph of order n such that the degree sum of any pair of nonadjacent vertices is at least n−r, then G contains k vertexdisjoint subgraphs Hi, 1 ≤ i ≤ k, such that V (H1) ∪ . . . ∪ V (Hk) = V (G) and such that Hi is a cycle or isomorphic to K1 for each i with 1 ≤ i ≤ r, and Hi is a cycle for each i with r + 1 ...
متن کاملDegree conditions for the partition of a graph into cycles, edges and isolated vertices
Let k, n be integers with 2 ≤ k ≤ n, and let G be a graph of order n. We prove that if max{dG(x), dG(y)} ≥ (n − k + 1)/2 for any x, y ∈ V (G) with x = y and xy / ∈ E(G), then G can be partitioned into k subgraphs H1, . . . ,Hk such that Hi is a cycle or K1 or K2 for each 1 ≤ i ≤ k unless k = 2 and G = C5 or k = 3 and G = K1 ∪ C5.
متن کاملTrees through specified vertices
We prove a conjecture of Horak that can be thought of as an extension of classical results including Dirac’s theorem on the existence of Hamiltonian cycles. Namely, we prove for 1 ≤ k ≤ n − 2 if G is a connected graph with A ⊂ V (G) such that dG(v) ≥ k for all v ∈ A, then there exists a subtree T of G such that V (T ) ⊃ A and dT (v) ≤ ⌈ n−1 k ⌉ for all v ∈ A.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00349-1